2-D skew-cyclic codes overFq[x,y;ρ,θ]
نویسندگان
چکیده
منابع مشابه
Skew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملOn Skew Cyclic and Quasi - cyclic Codes Over F 2 + uF 2 + u 2 F 2
We construct a new Gray map from S to F 3n 2 where S = F2+uF2+uF2, u3 = 1. It is both an isometry and a weight preserving map. It was shown that the Gray image of cyclic code over S is quasi-cyclic codes of index 3 and the Gray image of quasi-cyclic code over S is l-quasi-cyclic code of index 3. Moreover, the skew cyclic and skew quasi-cyclic codes over S introduced and the Gray images of them ...
متن کامل2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملOn Z2Z4[\xi]-Skew Cyclic Codes
Z2Z4-additive codes have been defined as a subgroup of Z r 2 ×Z s 4 in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set Zr2[ξ̄] × Z s 4[ξ] where ξ is the root of a monic basic primitive polynomial in Z4[x]. We give the standard form of the generator and parity-check matrices of codes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2014
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2013.08.001